ABSTRACT
This paper presents a key agreement protocol based on a non abelian group. It is proved that the proposed protocol meets
several security attributes under the assumption that the Root Problem (RP) in braid group is a hard problem.
Keywords: - Non abelian group, braid group, root problem, key agreement, and security.